A New Method for Determining Fixed Priority Configurations for Real-Time Systems on Multiprocessor Targets
نویسنده
چکیده
Several methods have been developed for determining fixed priority configurations on uniprocessor. In this paper, we present a new method, called PFX, for determining fixed priority configurations on multiprocessor. PFX follows an offline approach: our constructive process uses an inductive analysis of the whole set of possibilities. Therefore, PFX provides all valid fixed priority configurations. Experimentations (section V) show that PFX is very efficient on multiprocessor and subsumes Rate Monotonic (RM), Deadline Monotonic (DM) as well as Earliest Deadline First (EDF). In addition, we have found task systems which can be scheduled by PFX, but can not be scheduled by RM, DM, EDF or Least Laxity First (LLF).
منابع مشابه
Multiprocessor Scheduling For Real Time Systems Embedded Systems
energy-ef?cient tasks scheduling algorithm for real-time utility accrual real-time scheduling for multiprocessor multiprocessor real-time scheduling in industrial embedded a novel approach for off-line multiprocessor scheduling in multiprocessor scheduling for real time systems embedded robust partitioned scheduling for realtime multiprocessor multiprocessor scheduling for real time systems emb...
متن کاملFixed-Priority Multiprocessor Scheduling with Liu & Layland’s Utilization Bound
Liu and Layland discovered the famous utilization bound N(2 1 N − 1) for fixed-priority scheduling on singleprocessor systems in the 1970’s. Since then, it has been a long standing open problem to find fixed-priority scheduling algorithms with the same bound for multiprocessor systems. In this paper, we present a partitioning-based fixed-priority multiprocessor scheduling algorithm with Liu and...
متن کاملThread-level priority assignment in global multiprocessor scheduling for DAG tasks
The advent of multiand many-core processors offers enormous performance potential for parallel tasks that exhibit sufficient intra-task thread-level parallelism. With a growth of novel parallel programming models (e.g., OpenMP, MapReduce), scheduling parallel tasks in the real-time context has received an increasing attention in the recent past. While most studies focused on schedulability anal...
متن کاملPredictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems
The multiprocessor Fixed-Job Priority (FJP) scheduling of real-time systems is studied. An important property for the schedulability analysis, the predictability (regardless to the execution times), is studied for heterogeneous multiprocessor platforms. Our main contribution is to show that any FJP schedulers are predictable on unrelated platforms. A convenient consequence is the fact that any ...
متن کاملFixed-priority global scheduling for mixed-criticality real-time systems
There has been a growing interest in recent years in mixed-criticality real-time systems in which tasks are attributed different levels of criticality based on the degree to which their deadlines must be assured. While most of the initial efforts on mixed-criticality systems targeted single-processor systems, the research community has recently started to investigate multiprocessor mixed-critic...
متن کامل